Voronoi diagram and medial axis algorithm for planar domains with curved boundaries — II: Detailed algorithm description

Details of algorithms to construct the Voronoi diagrams and medial axes of planars domain bounded by free-form (polynomial or rational) curve segments are presented, based on theoretical foundations given in the rst installment Ramamurthy and Farouki, J. Comput. Appl. Math. (1999) 102 119–141 of this two-part paper. In particular, we focus on key topological and computational issues that arise in these constructions. The topological issues include: (i) the data structures needed to represent various geometrical entities — bisectors, Voronoi regions, etc., and (ii) the Boolean operations (i.e., union, intersection, and di erence) on planar sets required by the algorithm. Speci cally, representations for the Voronoi polygons of boundary segments, and for individual Voronoi diagram or medial axis edges, are proposed. Since these edges may be segments of (a) nonrational algebraic curves (curve=curve bisectors); (b) rational curves (point=curve bisectors); or (c) straight lines (point=point bisectors), data structures tailored to each of these geometrical entities are introduced. The computational issues addressed include the curve intersection algorithms required in the Boolean operations, and iterative schemes used to precisely locate bifurcation or “n-prong” points (n¿3) of the Voronoi diagram and medial axis. A selection of computed Voronoi diagram and medial axis examples is included to illustrate the capabilities of the algorithm. c © 1999 Elsevier Science B.V. All rights reserved.